Hybrid model generation for superstructure optimization with Generalized Disjunctive Programming

نویسندگان

چکیده

We propose a novel iterative procedure to generate hybrid models (HMs) within an optimization framework solve design problems. HMs are based on first principle and surrogate (SMs) they may represent potential plant units embedded superstructure. initial SMs with simple algebraic regression refine them by adding Gaussian Radial Basis Functions in three steps: SM refinement, domain exploration, and, after solving the optimal problem, further exploitation, until convergence criterion is fulfilled. The superstructure problem formulated Generalized Disjunctive Programming solved Logic-based Outer Approximation algorithm. addressed methanol synthesis propylene Compared rigorous model-based design, proposed gave same configuration, objective function decision variables maximum relative differences of 1 7 %, respectively. A sensitivity analysis shows that strategy reduced CPU time 33 %.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Algorithms for Nonlinear Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) has been introduced recently as an alternative model to MINLP for representing discrete/continuous optimization problems. The basic idea of GDP consists of representing discrete decisions in the continuous space with disjunctions, and constraints in the discrete space with logic propositions. In this paper, we describe a new convex nonlinear relaxation ...

متن کامل

Convex programming for disjunctive convex optimization

Given a nite number of closed convex sets whose algebraic representation is known, we study the problem of optimizing a convex function over the closure of the convex hull of the union of these sets. We derive an algebraic characterization of the feasible region in a higher-dimensional space and propose a solution procedure akin to the interior-point approach for convex programming.

متن کامل

Visual Generalized Rule Programming Model for Prolog with Hybrid Operators

The rule-based programming paradigm is omnipresent in a number of engineering domains. However, there are some fundamental semantical differences between it and classic programming approaches. No generic solution for using rules to model business logic in classic software has been provided so far. In this paper a new approach for Generalized Rule-based Programming (GREP) is given. It is based o...

متن کامل

An Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information

This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative information can be represented explicitly and manipulated. We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay be...

متن کامل

Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization

Abstract. Generalized disjunctive programming (GDP) is an extension of the disjunctive programming paradigm developed by Balas. The GDP formulation involves Boolean and continuous variables that are specified in algebraic constraints, disjunctions and logic propositions, which is an alternative representation to the traditional algebraic mixedinteger programming formulation. After providing a b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Chemical Engineering

سال: 2021

ISSN: ['1873-4375', '0098-1354']

DOI: https://doi.org/10.1016/j.compchemeng.2021.107473